Bounds on set exit times of affine systems, using Linear Matrix Inequalities

Abstract Efficient computation of trajectories switched affine systems becomes possible, if for any such hybrid system, we can manage to efficiently compute the sequence switching times. Once times have been computed, easily between two successive switches as solution an ODE. Each time be seen a positive real root analytic function, thereby allowing efficient by using finding algorithms. These algorithms require finite interval, within which search time. In this paper, study problem computing upper bounds on times, and restrict our attention stable time-invariant systems. We provide semi-definite programming models taken ODE exit set described intersection few generalized ellipsoids. Through numerical experiments, show that resulting are tighter than reported before, while requiring only modest increase in